Dual Bases and Discrete Reproducing Kernels: A Unified Framework for RBF and MLS Approximation
نویسنده
چکیده
Moving least squares (MLS) and radial basis function (RBF) methods play a central role in multivariate approximation theory. In this paper we provide a unified framework for both RBF and MLS approximation. This framework turns out to be a linearly constrained quadratic minimization problem. We show that RBF approximation can be considered as a special case of MLS approximation. This sheds new light on both MLS and RBF approximation. Among the new insights are dual bases for the approximation spaces and certain discrete reproducing kernels.
منابع مشابه
A Two Level Approximation Technique for Structural Optimization
This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...
متن کامل1786 - 0091 Complete Interpolation Vs . Riesz Bases of Reproducing Kernels
In the study of Hilbert spaces of analytic functions, it is noticed that complete interpolating sequences and Riesz bases of reproducing kernels are dual notions. In this work we make this duality explicit by identifying sequences of complex numbers with linear operators.
متن کاملConditionally Positive Definite Kernels and Pontryagin Spaces
Conditionally positive definite kernels provide a powerful tool for scattered data approximation. Many nice properties of such methods follow from an underlying reproducing kernel structure. While the connection between positive definite kernels and reproducing kernel Hilbert spaces is well understood, the analog relation between conditionally positive definite kernels and reproducing kernel Po...
متن کاملStabilized Galerkin and Collocation Meshfree Methods
Meshfree methods have been formulated based on Galerkin type weak formulation and collocation type strong formulation. The approximation functions commonly used in the Galerkin based meshfree methods are the moving least-squares (MLS) and reproducing kernel (RK) approximations, while the radial basis functions (RBFs) are usually employed in the strong form collocation method. Galerkin type form...
متن کاملCompactly Supported Radial Basis Function Kernels
The use of kernels is a key factor in the success of many classification algorithms by allowing nonlinear decision surfaces. Radial basis function (RBF) kernels are commonly used but often associated with dense Gram matrices. We consider a mathematical operator to sparsify any RBF kernel systematically, yielding a kernel with a compact support and sparse Gram matrix. Having many zero elements i...
متن کامل